#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],l[maxn],r[maxn];
LL ans[maxn];
stack<LL>s;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++){
       cin>>a[i];
   }
   for(LL i=1;i<=n;i++){
      while(!s.empty()&&a[s.top()]>=a[i]) s.pop();
      if(!s.empty()) l[i]=s.top()+1;
      else l[i]=1;
      s.push(i);
   }
   while(!s.empty()) s.pop();
   for(LL i=n;i>=1;i--){
      while(!s.empty()&&a[s.top()]>=a[i]) s.pop();
      if(!s.empty()) r[i]=s.top()-1;
      else r[i]=n;
      s.push(i);
   }

   for(LL i=1;i<=n;i++){
      ans[r[i]-l[i]+1]=max(ans[r[i]-l[i]+1],a[i]);
   }
   for(LL i=n;i>=1;i--){
       ans[i]=max(ans[i+1],ans[i]);
   }
   for(LL i=1;i<=n;i++){
       cout<<ans[i]<<" ";
   }
   cout<<"\n";
   return 0;
}
